Online load balancing with general reassignment cost
نویسندگان
چکیده
We investigate a semi-online variant of load balancing with restricted assignment. In this problem, we are given n jobs, which need to be processed by m machines the goal minimize maximum machine load. Since strong lower bounds rule out any competitive ratio o(log?n), may reassign jobs at certain job-individual cost. generalize result Gupta, Kumar, and Stein (SODA 2014) giving O(log?log?mn)-competitive algorithm constant amortized reassignment
منابع مشابه
Load Balancing in Structured P2P Systems using Server Reassignment Technique
Load balancing among application layer peer-to-peer (P2P) networks is critical for its effectiveness but, is considered to be the most important development for next-generation internet infrastructure. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of θ (log N) in the zone sizes. Two impo...
متن کاملLoad Balancing in Structured P2P Systems using Server Reassignment Technique
Two important contributions to minimize the same are proposed in [1]. First, the virtual-server-based load balancing problem using an optimization-based approach and deriving proposal in general and its advantages over previous strategies. Second, characterizing the effect of heterogeneity on load balancing algorithm performance and the conditions in which heterogeneity may be easy or hard to d...
متن کاملCost-eeective Data-parallel Load Balancing Cost-eeective Data-parallel Load Balancing
Load balancing algorithms improve a program's performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-eeective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon...
متن کاملOnline and Random-order Load Balancing Simultaneously
We consider the problem of online load balancing under lp-norms: sequential jobs need to be assigned to one of the machines and the goal is to minimize the lp-norm of the machine loads. This generalizes the classical problem of scheduling for makespan minimization (case l∞) and has been thoroughly studied. However, despite the recent push for beyond worst-case analyses, no such results are know...
متن کاملOffline file assignments for online load balancing
a r t i c l e i n f o a b s t r a c t We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased by this. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2022
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2022.03.007